Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("STERN, Michal")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 10 of 10

  • Page / 1
Export

Selection :

  • and

Single Bend Paths on a Grid have Strong Helly Number 4: errata atque emendationes ad Edge Intersection Graphs of Single Bend Paths on a GridGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Networks (New York, NY). 2013, Vol 62, Num 2, pp 161-163, issn 0028-3045, 3 p.Article

Edge Intersection Graphs of Single Bend Paths on a GridGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Networks (New York, NY). 2009, Vol 54, Num 3, pp 130-138, issn 0028-3045, 9 p.Article

The k-edge intersection graphs of paths in a treeGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 451-461, issn 0166-218X, 11 p.Conference Paper

Finding intersection models of weakly chordal graphsGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Lecture notes in computer science. 2006, pp 241-255, issn 0302-9743, isbn 3-540-48381-0, 15 p.Conference Paper

The complete optimal stars-clustering-tree problemKORACH, Ephraim; STERN, Michal.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 444-450, issn 0166-218X, 7 p.Conference Paper

Equivalences and the complete hierarchy of intersection graphs of paths in a treeGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3203-3215, issn 0166-218X, 13 p.Conference Paper

Representing edge intersection graphs of paths on degree 4 treesGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete mathematics. 2008, Vol 308, Num 8, pp 1381-1387, issn 0012-365X, 7 p.Conference Paper

On the bi-enhancement of chordal-bipartite probe graphsCOHEN, Elad; GOLUMBIC, Martin Charles; LIPSHTEYN, Marina et al.Information processing letters. 2010, Vol 110, Num 5, pp 193-197, issn 0020-0190, 5 p.Article

Intersection models of weakly chordal graphsGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2031-2047, issn 0166-218X, 17 p.Conference Paper

The clustering matroid and the optimal clustering treeKORACH, Ephraim; STERN, Michal.Mathematical programming. 2003, Vol 98, Num 1-3, pp 385-414, issn 0025-5610, 30 p.Conference Paper

  • Page / 1